Beam search heuristics for quadratic earliness and tardiness scheduling
نویسندگان
چکیده
منابع مشابه
Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
W e consider multimachine scheduling problems with earliness and tardiness costs. We first analyze problems in which the cost of a job is given by a general nondecreasing, convex function F of the absolute deviation of its completion time from a (common) unrestrictive duedate, and the objective is to minimize the sum of the costs incurred for all N jobs. (A special case to which considerable at...
متن کاملHeuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies involved in the construction of the greedy randomized schedules. On the other hand, these versions also differ on whether they employ only a f...
متن کاملA branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
This paper considers the problem of scheduling a single machine, in which the objective function is to minimize the weighted quadratic earliness and tardiness penalties and no machine idle time is allowed. We develop a branch and bound algorithm involving the implementation of lower and upper bounding procedures as well as some dominance rules. The lower bound is designed based on a lagrangian ...
متن کاملAn exact approach for single machine scheduling with quadratic earliness and tardiness penalties
her early schooling and unviersity preparatory studies in Qaemshahr. She then enrolled into Iran University of Science and Technology in Tehran after a highly selective admission procedure. In 2005, she finished her undergraduation studies in Mathematics with specialisation in topics of Applied Mathematics. After a brief 3-month training period spent working on updating flight managemeny system...
متن کاملGenetic algorithms for single machine scheduling with quadratic earliness and tardiness costs
In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. We propose a genetic approach based on a random key alphabet, and present several algorithms based on this approach. These versions differ on the generation of both the initial population and the individuals added in the migration step, as well as on the use o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2010
ISSN: 0160-5682,1476-9360
DOI: 10.1057/jors.2008.191